CS 6601-A Artificial Intelligence Project 1 Report A Genetic Algorithm for Symmetric TSP
ثبت نشده
چکیده
I proposed to implement a genetic algorithm [5] to solve the Traveling Salesman Problem. TSP is a classic problem in combinatorial search and optimization that has been well studied. It is often used as a benchmark for combinatorial or black-box optimization algorithms, and is one of the best known problems in graph theory. Applications of TSP include routing (shipping and logistics), job scheduling, and even the analysis of crystal structure [1].
منابع مشابه
A Novel Image Encryption Model Based on Hybridization of Genetic Algorithm, Chaos Theory and Lattice Map
Encryption is an important issue in information security which is usually provided using a reversible mathematical model. Digital image as a most frequently used digital product needs special encryption algorithms. This paper presents a new encryption algorithm high security for digital gray images using genetic algorithm and Lattice Map function. At the first the initial value of Logistic Map ...
متن کاملPerformance Improvement of Direct Torque Controlled Interior Permanent Magnet Synchronous Motor Drives Using Artificial Intelligence
The main theme of this paper is to present novel controller, which is a genetic based fuzzy Logic controller, for interior permanent magnet synchronous motor drives with direct torque control. A radial basis function network has been used for online tuning of the genetic based fuzzy logic controller. Initially different operating conditions are obtained based on motor dynamics incorporating...
متن کاملAdaptive Network-based Fuzzy Inference System-Genetic Algorithm Models for Prediction Groundwater Quality Indices: a GIS-based Analysis
The prediction of groundwater quality is very important for the management of water resources and environmental activities. The present study has integrated a number of methods such as Geographic Information Systems (GIS) and Artificial Intelligence (AI) methodologies to predict groundwater quality in Kerman plain (including HCO3-, concentrations and Electrical Conductivity (EC) of groundwater)...
متن کاملA Discrete Artificial Bee Colony Algorithm for TSP Problem
In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared wit...
متن کاملImmune-Genetic Algorithm for Traveling Salesman Problem
The Traveling Salesman Problem (TSP), first formulated as a mathematical problem in 1930, has been receiving continuous and growing attention in artificial intelligence, computational mathematics and optimization in recent years. TSP can be described as follows: Given a set of cities, and known distances between each pair of cities, the salesman has to find a shortest possible tour that visits ...
متن کامل